<HTML><HEAD><TITLE>graph_cycles(+Graph, -BreakingEdges)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(graph_algorithms)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>graph_cycles(+Graph, -BreakingEdges)</H1>
Computes a list of edges whose removal would make the graph acyclic
<DL>
<DT><EM>Graph</EM></DT>
<DD>a graph structure
</DD>
<DT><EM>BreakingEdges</EM></DT>
<DD>a list of e/3 edge structures
</DD>
</DL>
<H2>Description</H2>
<P>
    Computes a set of edges whose removal would make the graph acyclic.
    This set is not necessarily minimal, and it contains an arbitrary
    edge from every cycle in the graph.
</P><P>
    If the list is empty, the graph is already acyclic.
    </P>
<H3>Modes and Determinism</H3><UL>
<LI>graph_cycles(+, -) is det
</UL>
<H2>See Also</H2>
<A HREF="../../lib/graph_algorithms/graph_is_acyclic-1.html">graph_is_acyclic / 1</A>, <A HREF="../../lib/graph_algorithms/top_sort-2.html">top_sort / 2</A>
</BODY></HTML>
